A Gaze-enabled Graph Visualization to Improve Graph Reading Tasks
نویسندگان
چکیده
Performing typical network tasks such as node scanning and path tracing can be difficult in large and dense graphs. To alleviate this problem we use eye-tracking as an interactive input to detect tasks that users intend to perform and then produce unobtrusive visual changes that support these tasks. First, we introduce a novel fovea based filtering that dims out edges with endpoints far removed from a users view focus. Second, we highlight edges that are being traced at any given moment or have been the focus of recent attention. Third, we track recently viewed nodes and increase the saliency of their neighborhoods. All visual responses are unobtrusive and easily ignored to avoid unintentional distraction and to account for the imprecise and low-resolution nature of eye-tracking. We also introduce a novel gaze-correction approach that relies on knowledge about the network layout to reduce eye-tracking error. Finally, we present results from a controlled user study showing that our methods led to a statistically significant accuracy improvement in one of two network tasks and that our gaze-correction algorithm enables more accurate eye-tracking interaction.
منابع مشابه
Using Eye-Tracking as Interactive Input Enhances Graph Visualization
Much of the visual analysis of a graph reduces to a set of building-block visual tasks such as node scanning or edge and path tracing. These tasks may be trivial in small graphs but increase in complexity the larger and denser a graph visualization becomes. In this work, we use eye-tracking data as a real-time input to alter a graph visualization interactively and support its analysis. Specific...
متن کاملGazeVis: An Eye-Tracking Visualization Towards Predicting User Distraction CPSC 547 Project Report
We introduce GazeVis, a tool to visualize data gathered from a PDF reader application called GazeReader developed in another course. Our visualization aims to understand a reader’s gaze pattern before a self interruption occurs. We achieve this by allowing users to interactively inspect gaze related features over time. Furthermore, our visualization incorporates a prediction that determines if ...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملGroup-Level Graph Visualization Taxonomy
Task taxonomies for graph and network visualizations focus on tasks commonly encountered when analyzing graph connectivity and topology. However, in many application fields such as the social sciences (social networks), biology (protein interaction models), software engineering (program call graphs), connectivity and topology information is intertwined with group, clustering, and hierarchical i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 33 شماره
صفحات -
تاریخ انتشار 2014